Completeness of Global Evaluation Logic

نویسندگان

  • Sergey Goncharov
  • Lutz Schröder
  • Till Mossakowski
چکیده

Monads serve the abstract encapsulation of side effects in semantics and functional programming. Various monad-based specification languages have been introduced in order to express requirements on generic side-effecting programs. A basic role is played here by global evaluation logic, concerned with formulae which may be thought of as being universally quantified over the state space; this formalism is the fundament of more advanced logics such as monad-based Hoare logic or dynamic logic. We prove completeness of global evaluation logic for models in cartesian categories with a distinguished Heyting algebra object.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Distributed Contingency Logic and Security

In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...

متن کامل

Topological Pure Completeness for Hybrid Logics without the Global Modality

In this paper, we extend the general topological completeness result [3] of the strong hybrid language H(E) with the global modality E to the weaker hybrid language H(@) with the nominals i and the satisfaction operators @i (Theorem 1). Furthermore, we also generalize this topological completeness result of H(@) to monotonic neighborhood frames (Theorem 2).

متن کامل

From local to global temporal logics over Mazurkiewicz traces

We review some results on global and local temporal logic on Mazurkiewicz traces. Our main contribution is to show how to derive the expressive completeness of global temporal logic with respect to first order logic [9] from the similar result on local temporal logic [11].

متن کامل

The Importance of Being Discrete

The paper discusses discrete frames as an attractive semantics for modal logic. We study questions of completeness, persistence, duality and definability. Notions of completeness, strong global completeness and complexity of dual varieties coincide for discrete frames; moreover, they are equivalent to conservativity of minimal hybrid extensions. The paper also provides some criteria of di-persi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006